Mathematical Model and Simulated Annealing Algorithm for the Two-Dimensional Loading Heterogeneous Fixed Fleet Vehicle Routing Problem

This paper addresses the two-dimensional loading heterogeneous fixed fleet vehicle routing problem, which is a complex and unstudied variant of classical problem has wide range applications in transportation logistics fields. In this each customer demands set rectangular items, objective to find minimum cost delivery routes for limited vehicles with different capacities, variable operating costs, surfaces. We formulate mixed integer linear programming model obtain optimal solutions small-scale problems. To large-scale problems, we develop an algorithm based on simulated annealing local search, uses collection packing heuristics address constraints, also propose three new heuristics. conduct experiments benchmark instances derived from problem. The results indicate that proposed correctly describes can solve are effective improving heuristics, good problems within acceptable computational time. Hence, it be used by logistic companies using integrated planning routing.